Persistent homology and partial matching of shapes
نویسنده
چکیده
The ability to perform not only global matching but also partial matching is investigated in computer vision and computer graphics in order to evaluate the performance of shape descriptors. In my talk I will consider the persistent homology shape descriptor, and I will illustrate some results about persistence diagrams of occluded shapes and partial shapes. The main tool is a Mayer-Vietoris formula for persistent homology. Theoretical results indicate that persistence diagrams are able to detect a partial matching between shapes by showing a common subset of points both in the one-dimensional and the multi-dimensional setting. Experiments will be presented which outline the potential of the proposed approach in recognition tasks in the presence of partial information.
منابع مشابه
Persistent homology and partial similarity of shapes
The ability to perform shape retrieval based not only on full similarity, but also partial similarity is a key property for any content-based search engine. We prove that persistence diagrams can reveal a partial similarity between two shapes by showing a common subset of points. This can be explained using the MayerVietoris formulas that we develop for ordinary, relative and extended persisten...
متن کاملInvariance properties of the multidimensional matching distance in Persistent Topology and Homology
Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the ranks of persistent homology groups. Initially introduced by considering real-valued filtering functions, Persistent Topology has been subsequently generalize...
متن کاملA New Matching Algorithm for Multidimensional Persistence
An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of the values on its vertices. The resulting acyclic partial matching may be used to construct a reduced filtered complex with the same multidimensional persisten...
متن کاملStable shape comparison by persistent homology
When shapes of objects are modeled as topological spaces endowed with functions, the shape comparison problem can be dealt with using persistent homology to provide shape descriptors, and the matching distance to measure dissimilarities. Motivated by the problem of dealing with incomplete or imprecise acquisition of data in computer vision and computer graphics, recent papers have studied stabi...
متن کاملPersistent Heat Signature for Pose-oblivious Matching of Incomplete Models
Although understanding of shape features in the context of shape matching and retrieval has made considerable progress in recent years, the case for partial and incomplete models in presence of pose variations still begs a robust and efficient solution. A signature that encodes features at multi-scales in a pose invariant manner is more appropriate for this case. The Heat Kernel Signature funct...
متن کامل